1875A - Jellyfish and Undertale - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;
#define lli long long int

int main()
{
  int T;
  cin>>T;
  while(T--) {
    lli a,b,n;
    cin>>a>>b>>n;
    vector<int> tools;
    for(int i=0; i<n; i++) {
      int t;
      cin>>t;
      tools.push_back(t);
    }
    sort(tools.begin(), tools.end());
    lli ans = 0;
    ans = b-1;
    b = 1;
    for(int i=0; i<tools.size(); i++) {
      b = min(b+tools[i], a);
      ans += b-1;
      //cout<<tools[i]<<" "<<b<<endl;
      b = 1;
    }
    ans++;
    cout<<ans<<endl;
  }
  return 0;
}

/*
1
5 3 3
1 1 7

*/